bitwise negation - определение. Что такое bitwise negation
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое bitwise negation - определение

COMPUTER OPERATION THAT OPERATES ON VALUES AT THE LEVEL OF THEIR INDIVIDUAL BITS
Binary and; Bitshift; Bitwise; Bit-shift; Bitwise operations; Bit shift; Bitwise NOT; Bitwise AND; Bitwise operator; Bitwise OR; Bitwise negation; Bitwise operators; Bit wise; Bit complement; Bitwise shift; Bit shifting; Bitwise rotation; Bit rotation; Bitwise logic; Bit operators; Bitwise XOR; Bitwise logical operation; Bitwise logical operator; Bit operation; Bit operator; Binary shift; Right-shift operator; Left-shift operator; Bitwise complement; Binary OR; Binary NOT; Logical bitwise operator; Bitwise Right-Shift; Bitwise xor; Bitwise Operation; Shift (bit); Bitshifts; Binary AND; Bitwise or; Bitwise and; Bitwise not; Bit-wise not; Bit-wise NOT; Bit-wise and; Bit-wise AND; Bit-wise xor; Bit-wise XOR; Bit-wise or; Bit-wise OR; Bit shift operation; Bit shift operations; Bit rotate
  • 4-bit]] integers
  • Bitwise OR of 4-bit integers
  • Left circular shift or rotate
  • Left arithmetic shift
  • Left logical shift
  • Left rotate through carry
  • Right circular shift or rotate
  • Right arithmetic shift
  • Right logical shift
  • Right rotate through carry
  • Bitwise XOR of 4-bit integers
Найдено результатов: 40
bitwise         
<programming> A bitwise operator treats its operands as a vector of bits rather than a single number. Boolean bitwise operators combine bit N of each operand using a Boolean function (NOT, AND, OR, XOR) to produce bit N of the result. For example, a bitwise AND operator ("&" in C) would evaluate 13 & 9 as (binary) 1101 & 1001 = 1001 = 9, whereas, the logical AND, (C "&&") would evaluate 13 && 9 as TRUE && TRUE = TRUE = 1. In some languages, e.g. Acorn's BASIC V, the same operators are used for both bitwise and logical operations. This usually works except when applying NOT to a value x which is neither 0 (false) nor -1 (true), in which case both x and (NOT x) will be non-zero and thus treated as TRUE. Other operations at the bit level, which are not normally described as "bitwise" include shift and rotate. (1995-05-12)
bitwise         
¦ adjective Computing denoting an operator in a programming language which manipulates the individual bits in a byte or word.
bitwise complement         
The bitwise complement of a bit field is a bit field of the same length but with each zero changed to a one and vice versa. This is the same as the ones complement of a binary integer. (1994-11-14)
Bitwise operation         
In computer programming, a bitwise operation operates on a bit string, a bit array or a binary numeral (considered as a bit string) at the level of its individual bits. It is a fast and simple action, basic to the higher-level arithmetic operations and directly supported by the processor.
Negation as failure         
NON-MONOTONIC INFERENCE RULE IMPLYING THAT THE IMPOSSIBILITY TO DERIVE A STATEMENT ALLOWS TO INFER ITS NEGATION
Negation by failure; Weak negation
Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive \mathrm{not}~p (i.e.
negation by failure         
NON-MONOTONIC INFERENCE RULE IMPLYING THAT THE IMPOSSIBILITY TO DERIVE A STATEMENT ALLOWS TO INFER ITS NEGATION
Negation by failure; Weak negation
An extralogical feature of Prolog and other {logic programming} languages in which failure of unification is treated as establishing the negation of a relation. For example, if Ronald Reagan is not in our database and we asked if he was an American, Prolog would answer "no". (1994-11-29)
Negation         
OPERATION THAT TAKES A PROPOSITION P TO ANOTHER PROPOSITION "NOT P", WRITTEN ¬P, WHICH IS INTERPRETED INTUITIVELY AS BEING TRUE WHEN P IS FALSE, AND FALSE WHEN P IS TRUE; UNARY (SINGLE-ARGUMENT) LOGICAL CONNECTIVE
Logical not; Not (logic); ¬; Not sign; Negate; Logical NOT; ⌐; Negation sign; Logical negation; Negated; ¬; Logical Complement; Logical complement; Not operator; Logical Negation; ⌙; !vote; Logical opposite; Negation (mathematics); U+00AC; Negation (logic); Quantifier negation; Negation (logics); Negation elimination; ¬
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P, \mathord{\sim} P or \overline{P}. It is interpreted intuitively as being true when P is false, and false when P is true.
negation         
OPERATION THAT TAKES A PROPOSITION P TO ANOTHER PROPOSITION "NOT P", WRITTEN ¬P, WHICH IS INTERPRETED INTUITIVELY AS BEING TRUE WHEN P IS FALSE, AND FALSE WHEN P IS TRUE; UNARY (SINGLE-ARGUMENT) LOGICAL CONNECTIVE
Logical not; Not (logic); ¬; Not sign; Negate; Logical NOT; ⌐; Negation sign; Logical negation; Negated; ¬; Logical Complement; Logical complement; Not operator; Logical Negation; ⌙; !vote; Logical opposite; Negation (mathematics); U+00AC; Negation (logic); Quantifier negation; Negation (logics); Negation elimination; ¬
1.
The negation of something is its complete opposite or something which destroys it or makes it lose its effect. (FORMAL)
Unintelligible legislation is the negation of the rule of law and of parliamentary democracy.
N-SING: N of n
2.
Negation is disagreement, refusal, or denial. (FORMAL)
Irena shook her head, but in bewilderment, not negation.
? affirmation
N-UNCOUNT
Negation         
OPERATION THAT TAKES A PROPOSITION P TO ANOTHER PROPOSITION "NOT P", WRITTEN ¬P, WHICH IS INTERPRETED INTUITIVELY AS BEING TRUE WHEN P IS FALSE, AND FALSE WHEN P IS TRUE; UNARY (SINGLE-ARGUMENT) LOGICAL CONNECTIVE
Logical not; Not (logic); ¬; Not sign; Negate; Logical NOT; ⌐; Negation sign; Logical negation; Negated; ¬; Logical Complement; Logical complement; Not operator; Logical Negation; ⌙; !vote; Logical opposite; Negation (mathematics); U+00AC; Negation (logic); Quantifier negation; Negation (logics); Negation elimination; ¬
·adv Description or definition by denial, exclusion, or exception; statement of what a thing is not, or has not, from which may be inferred what it is or has.
II. Negation ·adv The act of denying; assertion of the nonreality or untruthfulness of anything; declaration that something is not, or has not been, or will not be; denial;
- the opposite of affirmation.
logical complement         
OPERATION THAT TAKES A PROPOSITION P TO ANOTHER PROPOSITION "NOT P", WRITTEN ¬P, WHICH IS INTERPRETED INTUITIVELY AS BEING TRUE WHEN P IS FALSE, AND FALSE WHEN P IS TRUE; UNARY (SINGLE-ARGUMENT) LOGICAL CONNECTIVE
Logical not; Not (logic); ¬; Not sign; Negate; Logical NOT; ⌐; Negation sign; Logical negation; Negated; ¬; Logical Complement; Logical complement; Not operator; Logical Negation; ⌙; !vote; Logical opposite; Negation (mathematics); U+00AC; Negation (logic); Quantifier negation; Negation (logics); Negation elimination; ¬
<logic> In Boolean algebra, the logical complement or negation of a Boolean value is the opposite value, given by the following truth table: A | -A --+--- T | F F | T -A is also written as A with a bar over it or with a small vertical line hanging from the right-hand end of the "-" (LaTeX eg) or as A'. In the C programming language, it is !A and in digital circuit design, /A. (1995-01-24)

Википедия

Bitwise operation

In computer programming, a bitwise operation operates on a bit string, a bit array or a binary numeral (considered as a bit string) at the level of its individual bits. It is a fast and simple action, basic to the higher-level arithmetic operations and directly supported by the processor. Most bitwise operations are presented as two-operand instructions where the result replaces one of the input operands.

On simple low-cost processors, typically, bitwise operations are substantially faster than division, several times faster than multiplication, and sometimes significantly faster than addition. While modern processors usually perform addition and multiplication just as fast as bitwise operations due to their longer instruction pipelines and other architectural design choices, bitwise operations do commonly use less power because of the reduced use of resources.